One-Way IND-CNA Key Setup - a Step Towards Provably Secure Symmetric Encryption
نویسنده
چکیده
We analyse the consequences of the specific properties of the key-setup phase in symmetric encryption schemes for their security. We find that key-setup routines satisfying IND-CNA and one-wayness allow to construct schemes which are provably secure against key-recovery attacks. We propose a specific cryptosystem for which we show that the key-setup routine ensures a significant increase in the security of the scheme regardless of the possible attacks against the underlying cipher. The paper presents a proof, based on a set of assumptions, that the scheme remains secure even if a successful key-recovery attack against the underlying cipher is found.
منابع مشابه
Security of Symmetric Encryption Schemes with One-Way IND-CNA Key Setup
We analyse the consequences of specific properties of the key-setup phase in symmetric encryption schemes for their security. We find that key-setup routines satisfying IND-CNA and one-wayness allow to construct schemes which are provably secure against key-recovery attacks. We propose a specific cryptosystem based on a stream cipher with a one-way IND-CNA key-setup, for which we present a proo...
متن کاملPSEC: Provably Secure Elliptic Curve Encryption Scheme (Submission to P1363a)
We describe an elliptic curve encryption scheme, PSEC (provably secure elliptic curve encryption scheme), which has two versions: PSEC-1 and PSEC-2. PSEC-1 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function and a random function (hash function). PSEC-2 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function, two random funct...
متن کاملPSEC { 3 : Provably Secure Elliptic Curve Encryption Scheme { V 3 (
We describe a new version of the elliptic curve encryption schemes PSEC (Provably Secure Elliptic Curve). PSEC{3 is a public-key encryption system that uses the elliptic curve El Gamal trapdoor function and two random functions (hash functions) as well as any semantically secure symmetric encryption scheme, such as the one-time pad, or any classical block-cipher. Furthermore, we de ne a new pro...
متن کاملArtemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملHow to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes
Suppose that we wish to encrypt long messages with small overhead by a public key encryption scheme which is secure against adaptive chosen ciphertext attack (IND-CCA2). Then the previous schemes require either a large size one-way trapdoor permutation (OAEP) or both a large size symmetric encryption scheme and a small size asymmetric encryption scheme (hybrid encryption). In this paper, we sho...
متن کامل